Quasar: A New Tool for Concurrent Ada Programs Analysis
نویسندگان
چکیده
Concurrency introduces a high degree of combinatory which may be the source of subtle mistakes. We present a new tool, Quasar, which is based on ASIS and which uses fully the concept of patterns. The analysis of a concurrent Ada program by our tool proceeds in four steps: automatic extraction of the concurrent part of the program; translation of the simplified program into a formal model using predefined patterns that are combined by substitution and merging constructors; analysis of the model both by structural techniques and model-checking techniques; reporting deadlock or starvation results. We demonstrate the usefulness of Quasar by analyzing several variations of a non trivial concurrent program.
منابع مشابه
Static Dependency Analysis for Concurrent Ada 95 Programs
Program dependency analysis is an analysis technique to identify and determine various program dependencies in program source codes. It is an important approach to testing, understanding, maintaining and transforming programs. But, there are still many difficulties to be solved when carrying out dependency analysis for concurrent programs because the execution of statements is unpredictable. In...
متن کاملA New Approach for Concurrent Program Slicing
Regarding the progress made in model analysis, more complex models, and consequently more complex programs can now be analyzed. However, this remains a difficult task in particular for concurrent programs which induce a lot of combinatory. Another way to reduce this complexity is to use program decomposition. Program decomposition technics extract a part of a given program while preserving the ...
متن کاملConcurrent program metrics drawn by QUASAR numbers
Aiming at developing reliable concurrent software, the engineering practice uses appropriate metrics. Quasar, the tool that we develop for automatically analyzing the concurrent part of programs, provides some data as a result of its program analysis. We attempt to use them as metrics and to show their usefulness for software engineering and for reliable programming control. In addition to the ...
متن کاملAn Approach to Model Checking Ada Programs
This paper describes a tool-supported method for the formal verification of Ada programs. It presents ATOS, a tool that automatically extracts a model in SPIN from an Ada Program, together with a set of properties that state the correctness of the model. ATOS is also capable of extracting properties from user-provided annotations in Ada programs, inspired by the Spark Annotation language. The g...
متن کاملFlow Analysis for Verifying Speci cations of Concurrent and Distributed Software
This paper presents FLAVERS, a nite state veri cation approach that analyzes whether concurrent or sequential programs satisfy user-de ned correctness properties. In contrast to other nite-state veri cation techniques, FLAVERS is based on algorithms with low-order polynomial bounds on the running time. FLAVERS achieves this e ciency at the cost of precision. Users, however, can improve the prec...
متن کامل